The Galois System: Optimistic Parallelization of Irregular Programs
نویسنده
چکیده
processor, making the scheduler partition-aware can lead to inter-core locality benefits for other structures as well. For example, in Delaunay mesh generation, this data-centric scheduling policy ensures that different cores work on triangles from different partitions of the mesh, reducing data contention and the likelihood of speculation conflicts. It is not clear that data-centric scheduling is always the best scheduling policy when using partitioned data structures. We explore a number of alternate scheduling policies in Chapter 5.
منابع مشابه
On the Scalability of an Automatically Parallelized Irregular Application
Irregular applications, i.e., programs that manipulate pointer-based data structures such as graphs and trees, constitute a challenging target for parallelization because the amount of parallelism is input dependent and changes dynamically. Traditional dependence analysis techniques are too conservative to expose this parallelism. Even manual parallelization is difficult, time consuming, and er...
متن کاملProcessor Allocation for Optimistic Parallelization of Irregular Programs
Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: potentially interfering tasks are launched dynamically, and the runtime system detects conflicts between concurrent activities, aborting and rolling back conflicting tasks. However, parallelism in irregular algorithms is very complex. In a regular algorithm like dense matrix multiplication, the a...
متن کاملParallelization of general purpose programs using optimistic techniques from parallel discrete event simulation
This thesis discusses the use of the virtual time paradigm as a mechanism for parallelizing sequential object-oriented code. Most parallelizing compilers to date have used compile time data-dependency analysis to determine independent sections of code. Compilers relying solely on data-dependency analysis are often unsuccessful at extracting parallelism from sequential programs. This is due to f...
متن کاملSUPERB Support for Irregular Scienti c Computations
Runtime support for parallelization of scientiic programs is needed when some information important for decisions in this process cannot be accurately derived at compile time. This paper describes a project which integrates runtime parallelization with advanced compile-time parallelization techniques of SUPERB. Besides the description of implementation techniques, language constructs are propos...
متن کاملParallelizing Irregular Applications with the Vienna HPF+ Compiler VFC
Applications based on highly irregular, dynamically changing data structures cannot be handled eeciently with current High Performance Fortran and available HPF compilers. In order to support such applications, extensions of the language as well as sophisticated analysis and parallelization techniques are required. In this paper we introduce the Vienna HPF+ Compiler (VFC), a new source-to-sourc...
متن کامل